Entropy distribution and condensation in random networks with a given degree distribution
نویسندگان
چکیده
منابع مشابه
Maximal entropy random networks with given degree distribution
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the distribution of connected components. We determine the size of the percolation cluster above the percolation threshold. The conditional degree distribution on...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Sparse Maximum-Entropy Random Graphs with a Given Power-Law Degree Distribution
Even though power-law or close-to-power-law degree distributions are ubiquitously observed in a great variety of large real networks, the mathematically satisfactory treatment of random power-law graphs satisfying basic statistical requirements of realism is still lacking. These requirements are: sparsity, exchangeability, projectivity, and unbiasedness. The last requirement states that entropy...
متن کاملGenerating random networks from a given distribution
Several variations are given for an algorithm that generates random networks approximately respecting the probabilities given by any likelihood function, such as from a p social network model. A novel use of the genetic algorithm is incorporated in these methods, which improves its applicability to the degenerate distributions that can arise with p models. Our approach includes a convenient way...
متن کاملThe distribution of nodes of given degree in random trees
Let Tn denote the set of unrooted unlabeled trees of size n and let k ≥ 1 be given. By assuming that every tree of Tn is equally likely it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value ∼ μkn and variance ∼ σ 2 k n with positive constants μk and σk. Besides, the asymptotic behavior of μk and σk for k → ∞ as well as the corresponding multivar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2014
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.89.062807